Gradient-Based Methods with Local Optimization
نویسندگان
چکیده
Multiple views of a scene can provide important information about the structure and dynamic behavior of three-dimensional objects. Many of the methods that recover this information require the determination of optical flow-the velocity, on the image, of visible points on object surfaces. An important class of techniques for estimating optical flow depend on the relationship between the gradients of image brightness. While gradient-based methods have been widely studied, little attention has been paid to accuracy and reliability of the approach. Gradient-based methods are sensitive to conditions commonly encountered in real imagery. Highly textured surfaces, large areas of constant brightness, motion boundaries, and depth discontinuities can all be troublesome for gradient-based methods. Fortunately, these problematic areas are usually localized can be identified in the image. In this paper we examine the sources of errors for gradient-based techniques that locally solve for optical flow. These methods assume that optical flow is constant in a small neighborhood. The consequence of violating in this assumption is examined. The causes of measurement errors and the determinants of the conditioning of the solution system are also considered. By understanding how errors arise, we are able to define the inherent limitations of the technique, obtain estimates of the accuracy of computed values, enhance the performance of the technique, and demonstrate the informative value of some types of error.
منابع مشابه
ISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES USING LEVEL SET METHOD INCORPORATING SENSITIVITY ANALYSIS
This study focuses on the topology optimization of structures using a hybrid of level set method (LSM) incorporating sensitivity analysis and isogeometric analysis (IGA). First, the topology optimization problem is formulated using the LSM based on the shape gradient. The shape gradient easily handles boundary propagation with topological changes. In the LSM, the topological gradient method as ...
متن کاملA New Strategy for Training RBF Network with Applications to Nonlinear Integral Equations
A new learning strategy is proposed for training of radial basis functions (RBF) network. We apply two different local optimization methods to update the output weights in training process, the gradient method and a combination of the gradient and Newton methods. Numerical results obtained in solving nonlinear integral equations show the excellent performance of the combined gradient method in ...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملDAMAGE DETECTION IN THIN PLATES USING A GRADIENT-BASED SECOND-ORDER NUMERICAL OPTIMIZATION TECHNIQUE
The purpose of the present study is the damage detection in the thin plates in terms of the wide application of such structures in various branches of engineering such as structural, mechanical, aerospace, shipbuilding, etc. using gradient-based second-order numerical optimization techniques. The technique used for optimization in this study is the second-order Levenberg-Marquardt algorithm (SO...
متن کاملAlternatives to Gradient - Based Neural Training
Neural networks are usually trained using local, gradient-based procedures, and the best architectures are selected by experimentation. Gradient methods frequently find suboptimal solutions being trapped in local minima. Genetic algorithms are frequently used but do not guarantee optimal solutions and are computationally expensive. Several new global optimization methods suitable for architectu...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کامل